import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();
        int[][] arr = new int[n+1][m+1];
        for(int i = 1; i < n+1; i++) {
            for(int j = 1; j <m+1; j++) {
                arr[i][j] = in.nextInt();
            }
        }

        // 创建前缀和矩阵，long防溢出
        long[][] dp = new long[n+1][m+1];
        for(int i = 1; i < n+1; i++) {
            for(int j = 1; j <m+1; j++) {
                // dp[i][i]：表示从[0, 0]位置到[i, j]位置这段区域内，所有元素的累加和
                dp[i][j] = dp[i-1][j] + dp[i][j-1] + arr[i][j] - dp[i-1][j-1];
            }
        }

        // 使用前缀和矩阵
        while(q > 0) {
            int x1 = in.nextInt(), y1 = in.nextInt(), x2 = in.nextInt(), y2 = in.nextInt();
            System.out.println(dp[x2][y2] - dp[x1-1][y2] - dp[x2][y1-1] + dp[x1-1][y1-1]);
            q--;
        }
    }
}